Evaluating an Algorithm for Parameterized Minimum Quartet Inconsistency
نویسندگان
چکیده
MINIMUM QUARTET INCONSISTENCY (MQI) Input: A set S of n taxa and a set QS of quartet topologies such that there is exactly one topology for every quartet set corresponding to S, and an integer k. Question: Is there an evolutionary tree T where the leaves are bijectively labeled by the elements from S such that the set of quartet topologies induced by T differs from QS in at most k quartet topologies?
منابع مشابه
A randomized fixed-parameter algorithm for the minimum quartet inconsistency problem
Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive integer k as the parameter, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the p...
متن کاملA fixed-parameter algorithm for minimum quartet inconsistency
Given n taxa, exactly one topology for every subset of four taxa, and a positive integer k (the parameter), the Minimum Quartet Inconsistency (MQI) problem is the question whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in only k quartet topologies. The more general problem where we are not necessarily given a topology for every subs...
متن کاملA polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
We present a polynomial time algorithm for the Minimum Quartet Inconsistency (MQI) problem when the number of quartet errors is O(n). This improves the previously best algorithmic result saying that if the number of quartet errors is at most (n− 3)/2 then the MQI problem can be solved in polynomial time. © 2006 Elsevier B.V. All rights reserved.
متن کاملApproximating minimum quartet inconsistency (abstract)
A fundamental problem in computational biology which has been widely studied in the last decades is the reconstruction of evolutionary trees from biological data. Unfortunately, almost all its known formulations are NPhard. The compelling need for having efficient computational tools to solve this biological problem has brought a lot of attention to the analysis of the quartet paradigm for infe...
متن کاملEfficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree
The triplet and quartet distances are distance measures to compare two rooted and two unrooted trees, respectively. The leaves of the two trees should have the same set of n labels. The distances are defined by enumerating all subsets of three labels (triplets) and four labels (quartets), respectively, and counting how often the induced topologies in the two input trees are different. In this p...
متن کامل